Least and greatest fixed points of a while semantics function
نویسنده
چکیده
The meaning of a program is given by specifying the function (from input to output) that corresponds to the program. The denotational semantic definition, thus maps syntactical things into functions. A relational semantics is a mapping of programs to relations. We consider that the input-output semantics of a program is given by a relation on its set of states. In a nondeterministic context, this relation is calculated by considering the worst behavior of the program (demonic relational semantics). In this paper, we concentrate on while loops. We will present some interesting results about the fixed points of the while semantics function; f(X) = Q ∨ P 2 X where P ∧ Q = Ø, by taking P := t 2 B and Q := t∼, one gets the demonic semantics we have assigned to while loops in previous papers. We will show that the least angelic fixed point is equal to the greatest demonic fixed point of the semantics function.
منابع مشابه
Demonic Fixed Points
We deal with a relational model for the demonic semantics of programs. The demonic semantics of a while loop is given as a fixed point of a function involving the demonic operators. This motivates us to investigate the fixed points of these functions. We give the expression of the greatest fixed point with respect to the demonic ordering (demonic inclusion) of the semantic function. We prove th...
متن کاملPartial and total correctness as greatest and least fixed points
This paper studies Hoare triples in the context of any programming language specified by a small-step, possibly non-deterministic, operational semantics. We explain how the partial correctness interpretation of the triple can be characterised as the greatest fixed point of a function, and how the total correctness interpretation can be seen as the least fixed point of that very same function. I...
متن کاملLeast and Greatest Fixed Points in Ludics
Various logics have been introduced in order to reason over (co)inductive specifications and, through the Curry-Howard correspondence, to study computation over inductive and coinductive data. The logic μMALL is one of those logics, extending multiplicative and additive linear logic with least and greatest fixed point operators. In this paper, we investigate the semantics of μMALL proofs in (co...
متن کاملAn Introduction to (Co)Algebras and (Co)Induction and their Application to the Semantics of Programming Languages
This report summarizes operational approaches to the formal semantics of programming languages and shows that they can be interpreted inductively by least fixed points as well as coinductively by greatest fixed points. While the inductive interpretation gives semantics to all terminating programs, the coinductive one defines moreover also a semantics for all non-terminating programs. This is es...
متن کاملCoincidence point and common fixed point results via scalarization function
The main purpose of this paper is to obtain sufficient conditions for existence of points of coincidence and common fixed points for three self mappings in $b$-metric spaces. Next, we obtain cone $b$-metric version of these results by using a scalarization function. Our results extend and generalize several well known comparable results in the existing literature.
متن کامل